Normal Tree Orders for Infinite Graphs
نویسندگان
چکیده
A well-founded tree T denned on the vertex set of a graph G is called normal if the endvertices of any edge of G are comparable in T. We study how normal trees can be used to describe the structure of infinite graphs. In particular, we extend Jung's classical existence theorem for trees of height w to trees of arbitrary height. Applications include a structure theorem for graphs without large complete topological minors. A number of open problems are suggested.
منابع مشابه
A simple existence criterion for normal spanning trees in infinite graphs
A spanning tree of an infinite graph is normal if the endvertices of any chord are comparable in the tree order defined by some arbitrarily chosen root. (In finite graphs, these are their ‘depth-first search’ trees; see [3] for precise definitions.) Normal spanning trees are perhaps the most important single structural tool for analysing an infinite graph (see [4] for a good example), but they ...
متن کاملNormal Spanning Trees, Aronszajn Trees and Excluded Minors
We prove that a connected infinite graph has a normal spanning tree (the infinite analogue of a depth-first search tree) if and only if it has no minor obtained canonically from either an (א0,א1)-regular bipartite graph or an order-theoretic Aronszajn tree. This disproves Halin’s conjecture that only the first of these obstructions was needed to characterize the graphs with normal spanning tree...
متن کاملMore exact predictions of SUSYM for string theory
We compute the coefficients of an infinite family of chiral primary operators in the local operator expansion of a circular Wilson loop in N = 4 supersymmetric YangMills theory. The computation sums all planar rainbow Feynman graphs. We argue that radiative corrections from planar graphs with internal vertices cancel in leading orders and we conjecture that they cancel to all orders in perturba...
متن کاملCountable locally 2-arc-transitive bipartite graphs
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We give several new families of previously unknown countably infinite locally-2-arc-transitive graphs, each family containing continuum many members. These exampl...
متن کاملThe monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation of relational structures defined by monadic second-order formulas, or equivalently, has bounded clique-width. We prove that this conjecture is true if and only if it is true for the particular cases of bipartite undirected graphs, of ...
متن کامل